On a combinatorial problem of Erdős
نویسندگان
چکیده
منابع مشابه
On the Erdős Discrepancy Problem
According to the Erdős discrepancy conjecture, for any infinite ±1 sequence, there exists a homogeneous arithmetic progression of unbounded discrepancy. In other words, for any ±1 sequence (x1, x2, ...) and a discrepancy C, there exist integers m and d such that | ∑ m i=1 xi·d| > C. This is an 80-year-old open problem and recent development proved that this conjecture is true for discrepancies ...
متن کاملOn a Combinatorial Problem
Let M be a set and F a family of its subsets. F is said by E. W. MILLER [5] to possess property B if there exists a subset K of M so that no set of the family F is contained either in K or in K (K is the complement of K in M) . HAJNAL and 1 [2] recently published a paper on the property B and its generalisations . One of the unsolved problems we state asks : What is the smallest integer in (n) ...
متن کاملReflections on a Problem of Erdős and Hajnal
The problem I am going to comment reached me in 1987 at Memphis in a letter of Uncle Paul. He wrote: 'We have the following problem with Hajnal. If G(n) has n points and does not contain induced C4, is it true that it has either a clique or an independent set with n 10 points? Kind regards to your boss+ colleagues, kisses to the E -s.' E.P.' After noting that E have been used in different conte...
متن کاملOn a Ramsey-type problem of Erdős and Pach
In this paper we show that there exists a constant C > 0 such that for any graph G on Ck ln k vertices either G or its complement G has an induced subgraph on k vertices with minimum degree at least 2 (k− 1). This affirmatively answers a question of Erdős and Pach from 1983.
متن کاملAround Erdős-Lovász problem on colorings of non-uniform hypergraphs
The talk deals with combinatorial problems concerning colorings of non-uniform hyper-graphs. Let H = (V, E) be a hypergraph with minimum edge-cardinality n. We show that if H is a simple hypergraph (i.e. every two distinct edges have at most one common vertex) and e∈E r 1−|e| c √ n, for some absolute constant c > 0, then H is r-colorable. We also obtain a stronger result for triangle-free simpl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 1966
ISSN: 0002-9939
DOI: 10.1090/s0002-9939-1966-0184866-9